منابع مشابه
Longest Segment Problems
The following problem is considered: Given a predicate p on strings. Determine the longest segment of a given string that satisfies p. This paper is an investigation of algorithms solving this problem for various predicates. The predicates considered are expressed in simple functions like the size, the minimum, the maximum, the leftmost and the rightmost element of the segment. The algorithms a...
متن کاملA longest matching segment approach for text-independent speaker recognition
We describe a new approach for segment-based speaker recognition, given text-independent training and test data. We assume that utterances from the same speaker have more and longer matching acoustic segments, compared to utterances from different speakers. Therefore, we identify the longest matching segments, at each frame location, between the training and test utterances, and base recognitio...
متن کاملRaga Verification in Carnatic Music Using Longest Common Segment Set
There are at least 100 rāgas that are regularly performed in Carnatic music concerts. The audience determines the identity of rāgas within a few seconds of listening to an item. Most of the audience consists of people who are only avid listeners and not performers. In this paper, an attempt is made to mimic the listener. A rāga verification framework is therefore suggested. The rāga verificatio...
متن کاملLongest Path Problems on Ptolemaic Graphs
SUMMARY Longest path problem is a problem for finding a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, there are few known graph classes such that the longest path problem can be solved efficiently. Polynomial time algorithms for finding a longest cycle and a longest path in a Ptolemaic graph are pr...
متن کاملFast Algorithms for the Constrained Longest Increasing Subsequence Problems
Let 〈a1, a2, . . . , an〉 be a sequence of comparable elements. In this paper, we study two constrained versions of the longest increasing subsequence (LIS) problem. The first problem is the range-constrained longest increasing subsequence (RLIS) problem. Given 0 < LI ≤ UI < n and 0 ≤ LV ≤ UV , the objective of the RLIS problem is to deliver a maximum-length increasing subsequence 〈ai1 , ai2 , ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1992
ISSN: 0167-6423
DOI: 10.1016/0167-6423(92)90033-8